A New Exact Resource Allocation Model with Hard and Soft Resource Constraints
نویسنده
چکیده
In this paper we present a mixed integer linear programming (MILP) resource allocation model with hard and soft resource constraints for projects. By definition, a hard resource constraint is not resolvable within the given planning horizon, but a soft resource conflict may be managed by a flexible "hiring-firing" strategy. A "well-balanced" optimal schedule for the soft resources is characterized by a new global bicriteria measure, namely the "peak resource requirement" and the "idle time" simultaneously. The application of the idle time measure for hard resources is optional, but if used it defines a "smooth load" schedule. In the proposed approach the goal function of the MILP model is defined as a weighted combination of the single criteria measures. The MILP model is created by automated transformational steps from a non-linear initial model based on the immediate precedence relations of the GANTT diagram. The practical interpretation of the proposed model is demonstrated in an analysis of a simplified small-scale business software development environment. In the presented problem we assumed that the number of software designers is a hard constraint within the given planning horizon, but the availability of programmers and testers are soft constraints, which can be resolved by "hiring-firing" in short term base. In this example we exploited the fact that in a
منابع مشابه
A Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کاملA mathematical model for the multi-mode resource investment problem
This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...
متن کاملOptimum allocation of Iranian oil and gas resources using multi-objective linear programming and particle swarm optimization in resistive economy conditions
This research presents a model for optimal allocation of Iranian oil and gas resources in sanction condition based on stochastic linear multi-objective programming. The general policies of the resistive economy include expanding exports of gas, electricity, petrochemical and petroleum products, expanding the strategic oil and gas reserves, increasing added value through completing the petroleum...
متن کاملA new approach for solving fuzzy multi-objective quadratic programming of water resource allocation problem
متن کامل
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کامل